Complete intersection points on general surfaces in P3

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolation on Surfaces in P3

Suppose S is a surface in P, and p1, . . . , pr are general points on S. What is the dimension of the space of sections of OS(e) having singularities of multiplicity mi at pi for all i? We formulate two natural conjectures which would answer this question, and we show they are equivalent. We then prove these conjectures in case all multiplicities are at most 4.

متن کامل

On Finding Ordinary Intersection Points∗

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n logn). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n logn). Two additiona...

متن کامل

On the probability distribution of data at points in real complete intersection varieties

We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real solution of real systems of multivariate polynomial equations and convergence radius of Newton’s operator for under-determined system of multi-variate polynomial equations.

متن کامل

Some Remarks on the Severi Varieties of Surfaces in P3

Continuing the work of Chiantini and Ciliberto (1999) on the Severi varieties of curves on surfaces in P3, we complete the proof of the existence of regular components for such varieties. 2000 Mathematics Subject Classification. 14H10, 14B07.

متن کامل

On Finding Ordinary or Monochromatic Intersection Points

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n log n). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n log n). Two additio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Michigan Mathematical Journal

سال: 2010

ISSN: 0026-2285

DOI: 10.1307/mmj/1281531455